Homogeneous polynomials on strictly convex domains
نویسندگان
چکیده
منابع مشابه
Composition operators between growth spaces on circular and strictly convex domains in complex Banach spaces
Let $\Omega_X$ be a bounded, circular and strictly convex domain in a complex Banach space $X$, and $\mathcal{H}(\Omega_X)$ be the space of all holomorphic functions from $\Omega_X$ to $\mathbb{C}$. The growth space $\mathcal{A}^\nu(\Omega_X)$ consists of all $f\in\mathcal{H}(\Omega_X)$ such that $$|f(x)|\leqslant C \nu(r_{\Omega_X}(x)),\quad x\in \Omega_X,$$ for some constant $C>0$...
متن کاملThe Dirichlet Problem for the Monge-ampère Equation in Convex (but Not Strictly Convex) Domains
It is well-known that the Dirichlet problem for the MongeAmpère equation det Du = μ in a bounded strictly convex domain Ω in R has a weak solution (in the sense of Aleksandrov) for any finite Borel measure μ on Ω and for any continuous boundary data. We consider the Dirichlet problem when Ω is only assumed to be convex, and give a necessary and sufficient condition on the boundary data for solv...
متن کاملStrictly Convex Corners Scatter
We prove the absence of non-scattering energies for potentials in the plane having a corner of angle smaller than π. This extends the earlier result of Bl̊asten, Päivärinta and Sylvester who considered rectangular corners. In three dimensions, we prove a similar result for any potential with a circular conic corner whose opening angle is outside a countable subset of (0, π).
متن کاملOn A Strictly Convex IBM Model 1
IBM Model 1 is a classical alignment model. Of the first generation word-based SMT models, it was the only such model with a concave objective function. For concave optimization problems like IBM Model 1, we have guarantees on the convergence of optimization algorithms such as Expectation Maximization (EM). However, as was pointed out recently, the objective of IBM Model 1 is not strictly conca...
متن کاملMinimum Strictly Convex Quadrangulations of Convex
We present a linear{time algorithm that decomposes a convex polygon conformally into a minimum number of strictly convex quadrilaterals. Moreover, we characterize the polygons that can be decomposed without additional vertices inside the polygon, and we present a linear{time algorithm for such decompositions, too. As an application , we consider the problem of constructing a minimum conformal r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2007
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-07-08939-3